Generalizing the Discrete Timed Automaton
نویسندگان
چکیده
We describe a general automata-theoretic approach for analyzing the verification problems (binary reachability, safety, etc.) of discrete timed automata augmented with various data structures. We give examples of such data structures and exhibit some new properties of discrete timed automata that can be verified. We also briefly consider reachability in discrete timed automata operating in parallel.
منابع مشابه
Generating Discrete Trace Transition System of a Polyhe-dral Invariant Hybrid Automaton
Supervisory control and fault diagnosis of hybrid systems need to have complete information about the discrete states transitions of the underling system. From this point of view, the hybrid system should be abstracted to a Discrete Trace Transition System (DTTS) and represented by a discrete mode transition graph. In this paper an effective method is proposed for generating discrete mode trans...
متن کاملBinary Reachability Analysis of Discrete Pushdown Timed Automata
We introduce discrete pushdown timed automata that are timed automata with integer-valued clocks augmented with a pushdown stack. A con guration of a discrete pushdown timed automaton includes a control state, nitely many clock values and a stack word. Using a pure automata-theoretic approach, we show that the binary reachability (i.e., the set of all pairs of con gurations ( ; ), encoded as st...
متن کاملIdentification of Timed Discrete-Event Models for Diagnosis
The paper deals with the discrete–event modelling of dynamical systems. The system inputs and outputs can only be qualitatively measured. The timed automaton is used as the discrete–event representation of such systems. The diagnosis is based on the investigation whether the qualitative input/output sequences obtained from the system are consistent with the timed automaton. The paper shows how ...
متن کاملOn Timed Automata with Discrete Time - Structural and Language Theoretical Characterization
We develop a structural and language theoretical characterization of timed languages over discrete time in terms of a variant of Büchi automata and languages. The so-called tick automaton is a standard Büchi automaton with a special “clock-tick”-input symbol modeling the discrete flow of time. Based on these characterizations we give an alternative proof for the fact that the class of regular t...
متن کاملRelations of Timed Event Graphs and Timed Automata in Fault Diagnosis
This paper investigates the relations between timed event graphs and timed automata that describe discrete–event systems subject to faults. An algorithm is presented for transforming a timed event graph into an equivalent timed automaton. The relations among the models of the faulty systems provides the basis for comparing diagnostic methods that have been developed in the past for these two ti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000